Sensitivity analyses for factorizations of sparse or structured matrices
نویسندگان
چکیده
منابع مشابه
Sparse Direct Factorizations through Unassembled Hyper-Matrices
We present a novel strategy for sparse direct factorizations that is geared towards the matrices that arise from hp-adaptive Finite Element Methods. In that context, a sequence of linear systems derived by successive local refinement of the problem domain needs to be solved. Thus, there is an opportunity for a factorization strategy that proceeds by updating (and possibly downdating) the factor...
متن کاملOn Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
The height of the elimination tree has long acted as the only criterion in deriving a suitable fill-preserving sparse matrix ordering for parallel factorization. Although the deficiency in adopting height as the criterion for all circumstances was well recognized, no research has succeeded in alleviating this constraint. In this paper, we extend the unit-cost fill-preserving ordering into a gen...
متن کاملDimensionality Reduction for Sparse and Structured Matrices
Dimensionality reduction has become a critical tool for quickly solving massive matrix problems. Especially in modern data analysis and machine learning applications, an overabundance of data features or examples can make it impossible to apply standard algorithms efficiently. To address this issue, it is often possible to distill data to a much smaller set of informative features or examples, ...
متن کاملFACTORIZATIONS FOR nD POLYNOMIAL MATRICES*
In this paper, a constructive general matrix factorization scheme is developed for extracting a nontrivial factor from a given nD (n > 2) polynomial matrix whose maximal order minors satisfy certain conditions. It is shown that three classes of nD polynomial matrices admit this kind of general matrix factorization. It turns out that minor prime factorization and determinantal factorization are ...
متن کاملElementary Estimators for Sparse Covariance Matrices and other Structured Moments
We consider the problem of estimating expectations of vector-valued feature functions; a special case of which includes estimating the covariance matrix of a random vector. We are interested in recovery under high-dimensional settings, where the number of features p is potentially larger than the number of samples n, and where we need to impose structural constraints. In a natural distributiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(98)10100-3